def gcd(a, b):
    if a < b:
        return gcd(b, a)
    else:
        return gcd(b, a % b) if a % b else b

def lcm(a, b):
    c = gcd(a, b)
    return max(a, b) / c * min(a, b)

a, b = map(int, input('请输入a, b的值').split())
print('a, b的最小公倍数为', int(lcm(a, b)))